Castelnuovo–Mumford regularity and arithmetic Cohen–Macaulayness of complete bipartite subspace arrangements
نویسندگان
چکیده
منابع مشابه
Regularity, Depth and Arithmetic Rank of Bipartite Edge Ideals
We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of invariants of the directed graph. For some classes of unmixed edge ideals, we show that the arithmetic rank of the ideal equals projective dimension of its quotient.
متن کاملEfficient Arithmetic Regularity and Removal Lemmas for Induced Bipartite Patterns
Let G be an abelian group of bounded exponent and A ⊂ G. We show that if the collection of translates of A has VC dimension at most d, then for every > 0 there is a subgroup H of G of index at most −d−o(1) such that one can add or delete at most |G| elements to A to make it a union of H-cosets. We also establish a removal lemma with polynomial bounds, with applications to property testing, for ...
متن کاملCharacteristic-free bounds for the CastelnuovoMumford regularity
We study bounds for the Castelnuovo–Mumford regularity of homogeneous ideals in a polynomial ring in terms of the number of variables and the degree of the generators. In particular, our aim is to give a positive answer to a question posed by Bayer and Mumford in What can be computed in algebraic geometry? (Computational algebraic geometry and commutative algebra, Symposia Mathematica, vol. XXX...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملA Sharp Bound for the Castelnuovo-mumford Regularity of Subspace Arrangements Harm Derksen and Jessica Sidman
Over the past twenty years rapid advances in computational algebraic geometry have generated increasing amounts of interest in quantifying the “complexity” of ideals and modules. For a finitely generated module M over a polynomial ring S = k[x0, . . . , xn] with k an arbitrary field, we say that M is r-regular (in the sense of Castelnuovo and Mumford) if the i-th syzygy module of M is generated...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2015
ISSN: 0022-4049
DOI: 10.1016/j.jpaa.2014.07.027